Stationary distribution of an infinite-buffer batch-arrival and batch-service queue with random serving capacity and batch-size-dependent service

نویسندگان

چکیده

In traditional batch-service queueing systems, the mean service time of batches are generally assumed to be constant. However, in numerous applications this assumption may not appropriate. telecommunication networks, transmission rates depend on number packets batch which can framed as batch-size-dependent queue. The objective paper is focus both queue and server content distribution an infinite-buffer batch-arrival with random serving capacity rule service. After deriving a bivariate probability generating function length at departure epoch batch, we extract complete joint terms roots characteristic equation. We also obtain system well arbitrary epoch. Finally, significant numerical examples appended show feasibility analytic procedure results where occurrence multiple have been dealt without facing any difficulty. At end, graphical representation cost shows that more compared batch-size-independent

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of finite-buffer discrete-time batch-service queue with batch-size-dependent service

Over the last two decades there has been considerable growth in digital communication systems which operate on a slotted system. In several applications, transmission of packets over the network takes place in batches of varying size, and transmission time depends upon the size of the batch. Performance modelling of these systems is usually done using discrete-time queues. In view of this, we c...

متن کامل

Emergency Service Vehicle Location Problem with Batch Arrival of Demands

In this paper an emergency service vehicle (ESV) location problem has been considered in which it is assumed that each emergency call may require more than one ESV. In ESV location problem two factors should be known; the location of stations and the number of ESVs at each station. Hence, a nonlinear mixed integer programming model is presented in order to maximize the total response rate to th...

متن کامل

Queue with Service Rates Depending on Service Batch Size

We consider a bulk service G I / M / l queue with service rates depending on service batch size. If there are n customers waiting at the completion of service, min(n, I\) customers enter service. We show that the queue size and the service batch size at points of arrivals form an embedded Markov chain and the steady-state probabilities of this Markov chain have the matrix geometric form. We des...

متن کامل

Finite Buffer Vacation Queue under E-limited with Limit Variation Service and Batch Markovian Arrival Process

Abstract: We consider a finite-buffer single server queue with single (multiple) vacation(s) under batch Markovian Arrival Process (BMAP). The service discipline is varying number limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of l customers have been served. Queue length distributions at va...

متن کامل

Infinite-server Queues with Batch Arrivals and Dependent Service Times

Motivated by large-scale service systems, we consider an infinite-server queue with batch arrivals, where the service times are dependent within each batch. We allow the arrival rate of batches to be time-varying as well as constant. As regularity conditions, we require that the batch sizes be i.i.d. and independent of the arrival process of batches, and we require that the service times within...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Operational Research

سال: 2021

ISSN: ['1745-7653', '1745-7645']

DOI: https://doi.org/10.1504/ijor.2021.111951